1. The Foundation: Limits and Sequential Approximation
We move from the theoretical abstraction of limits to the computational reality that a processor cannot approach zero; it can only approach a machine epsilon.
A function $f$ defined on a set $X$ has the limit $L$ at $x_0$, written $\lim_{x \to x_0} f(x) = L$, if, given any real number $\varepsilon > 0$, there exists a $\delta > 0$ such that $|f(x) - L| < \varepsilon$, whenever $x \in X$ and $0 < |x - x_0| < \delta$.
A sequence $\{x_n\}_{n=1}^{\infty}$ has the limit $x$ if, for any $\epsilon > 0$, there exists a positive integer $N(\epsilon)$ such that $|x_n - x| < \epsilon$ whenever $n > N(\epsilon)$. This justifies our iterative algorithms.
2. Continuity and Differentiability: Safety Requirements
In numerical software, Continuity (Definition 1.2) and Differentiability (Definition 1.5) are not just academic properties; they are "safety requirements" for numerical stability. Theorem 1.6 proves that if a function is differentiable at $x_0$, it is continuous at $x_0$, ensuring that small measurement errors do not result in catastrophic output jumps.